MaxSAT-Based Cutting Planes for Learning Graphical Models
نویسندگان
چکیده
A way of implementing domain-specific cutting planes in branch-andcut based Mixed-Integer Programming (MIP) solvers is through solving so-called sub-IPs, solutions of which correspond to the actual cuts. We consider the suitability of using Maximum satisfiability solvers instead of MIP for solving subIPs. As a case study, we focus on the problem of learning optimal graphical models, namely, Bayesian and chordal Markov network structures.
منابع مشابه
Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity (Extended Abstract)
Developing accurate algorithms for learning structures of probabilistic graphical models is an important problem within modern AI research. Here we focus on score-based structure learning for Bayesian networks as arguably the most central class of graphical models. A successful generic approach to optimal Bayesian network structure learning (BNSL), based on integer programming (IP), is implemen...
متن کاملMiniLearningHeapExpSimp / SAT4J
The SAT4J library [1] is an open source library of efficient SAT solvers in Java dedicated to people willing to embed SAT technology into their application without worrying about the details. SAT4J is currently used in model verification [10], ontology matching [5], requirements engineering [11], software product line configuration [2], etc. It started as a Java implementation of the MiniSAT sp...
متن کاملImportance Sampling over Sets: A New Probabilistic Inference Scheme
Computing expectations in high-dimensional spaces is a key challenge in probabilistic inference and machine learning. Monte Carlo sampling, and importance sampling in particular, is one of the leading approaches. We propose a generalized importance sampling scheme based on randomly selecting (exponentially large) subsets of states rather than individual ones. By collecting a small number of ext...
متن کاملBayesian Network Structure Learning with Integer Programming: Polytopes, Facets, and Complexity
The challenging task of learning structures of probabilistic graphical models is an important problem within modern AI research. Recent years have witnessed several major algorithmic advances in structure learning for Bayesian networks—arguably the most central class of graphical models—especially in what is known as the score-based setting. A successful generic approach to optimal Bayesian net...
متن کاملOn Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean Optimization (PBO) algorithms. This paper addresses the utilization of Gomory mixed-integer and clique cuts, in Satisfiability-based algorithms for PBO, and shows how these cuts can be used for computing lower bounds ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015